#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#define MAXN 105000
using namespace std;

int n;
int num[MAXN];

int main()
{
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> num[i];
    }
    sort(num + 1, num + n + 1);


    queue<int> s;
    int killed = 0;
    for(int i = 1; i <= n; ++i){
        if(s.empty()){
            s.push(num[i]);
            continue;
        }
        int now = s.front();
        if(num[i] > now){
            killed ++;
            s.pop();
        }
        s.push(num[i]);
    }
    cout << n - killed << endl;

    return 0;
}
